全文获取类型
收费全文 | 31061篇 |
免费 | 4163篇 |
国内免费 | 2849篇 |
专业分类
电工技术 | 4110篇 |
技术理论 | 5篇 |
综合类 | 4104篇 |
化学工业 | 1204篇 |
金属工艺 | 759篇 |
机械仪表 | 1832篇 |
建筑科学 | 3286篇 |
矿业工程 | 868篇 |
能源动力 | 1057篇 |
轻工业 | 901篇 |
水利工程 | 746篇 |
石油天然气 | 903篇 |
武器工业 | 377篇 |
无线电 | 2692篇 |
一般工业技术 | 2719篇 |
冶金工业 | 1044篇 |
原子能技术 | 213篇 |
自动化技术 | 11253篇 |
出版年
2024年 | 90篇 |
2023年 | 577篇 |
2022年 | 983篇 |
2021年 | 1178篇 |
2020年 | 1221篇 |
2019年 | 999篇 |
2018年 | 903篇 |
2017年 | 1209篇 |
2016年 | 1313篇 |
2015年 | 1508篇 |
2014年 | 2337篇 |
2013年 | 2189篇 |
2012年 | 2455篇 |
2011年 | 2543篇 |
2010年 | 1990篇 |
2009年 | 2042篇 |
2008年 | 2057篇 |
2007年 | 2154篇 |
2006年 | 1912篇 |
2005年 | 1596篇 |
2004年 | 1269篇 |
2003年 | 1095篇 |
2002年 | 898篇 |
2001年 | 722篇 |
2000年 | 604篇 |
1999年 | 397篇 |
1998年 | 314篇 |
1997年 | 259篇 |
1996年 | 226篇 |
1995年 | 212篇 |
1994年 | 166篇 |
1993年 | 116篇 |
1992年 | 95篇 |
1991年 | 80篇 |
1990年 | 61篇 |
1989年 | 55篇 |
1988年 | 45篇 |
1987年 | 24篇 |
1986年 | 18篇 |
1985年 | 19篇 |
1984年 | 16篇 |
1983年 | 20篇 |
1982年 | 19篇 |
1981年 | 16篇 |
1980年 | 14篇 |
1979年 | 10篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 5篇 |
1975年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
11.
The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy. 相似文献
12.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
13.
针对实体产业对科技资源的服务需求,以服务效应作为资源文本分类标准,提出一种基于多元神经网络融合的分布式资源空间文本分类模型。设计了包含词嵌入层、卷积层、双向门控循环单元层、注意力机制层和softmax层的多元神经网络通路;在此基础上采用基于需求—效应—资源分类策略,完成了从定性科技资源需求到定量资源服务效应求解,再到定性科技资源输出的映射变换,重点解决了分布式科技资源局部和全局语义特征形式多样、文本长距离依赖特征显著、重要资源信息难以准确识别的问题,进而从分布式科技资源空间中快速准确地获取效应知识,提升实体产业产品研发效率和创新能力;通过万方专利科技资源数据集验证了所提方法的可行性和有效性,为更加全面地挖掘资源文本特征和按需服务实体产业提供了一种新的思路和手段。 相似文献
14.
文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。 相似文献
15.
Stewart Clegg Catherine P. Killen Christopher Biesenthal Shankar Sankaran 《International Journal of Project Management》2018,36(5):762-772
Project portfolio management (PPM) bridges strategy and project management. Traditional research in PPM has primarily investigated the rational, top-down and structural aspects of strategizing. By doing so, it has failed to focus on the underlying practices that are triggered by the strategy and how these practices frame strategy implementation. Practice-based research provides a methodological lens to explore the reality of strategic enactment through the project portfolio. Practice-based perspectives are under-represented in PPM research; therefore the aim of this paper is to provide an agenda for further practice-based research in PPM. Central to this agenda is a concern with various aspects of practice, including its discursivity, representation, dynamic capabilities, leadership and materiality. 相似文献
16.
ABSTRACTFeature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets. 相似文献
17.
18.
Static pentane extraction as a potential alternative to Soxhlet extraction for polypropylene olive oil overall migration limit measurements 下载免费PDF全文
Static pentane extraction of olive oil from polypropylene was evaluated as a safer, higher throughput alternative to pentane Soxhlet extraction for the recovery of olive oil from polypropylene for overall migration limit determinations. Static, ambient temperature, pentane extraction achieved quantitative recovery of olive oil from polypropylene plaques prepared by using the OM‐5 overall migration limit protocol. In addition to validation data for static extractions, a modified esterification procedure is presented as a means to accommodate the larger sample sets that are enabled with static extraction. 相似文献
19.
与传统比例-积分-微分(PID)控制方法相比,滑模控制(SMC)方法可以比较容易地将不确定性纳入控制器设计中,从而增强系统的鲁棒性。探索了SMC技术在运载器主动段姿态控制中的工程应用,首先通过分析基于趋近律的SMC系统,提出了降低不连续切换项系数的需求,然后研究了基于干扰上界的SMC方法。三通道小偏差仿真结果验证了两种方法的控制效果,表明第2种控制器的鲁棒性更好,稳态误差小,同时发动机喷管摆角需求较小。 相似文献
20.
Nicholas Vergeylen Kenneth Srensen Pieter Vansteenwegen 《International Transactions in Operational Research》2020,27(6):2695-2714
This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds. 相似文献